|
|
Evolutionary Design Using Rewriting Systems
Hýsek, Jiří ; Jaroš, Jiří (referee) ; Bidlo, Michal (advisor)
This work provides an introduction to the evolutionary algorithms and evolutionary design. It also describes disadvantages of direct encoding of a genotype to a phenotype and a method of nontrivial encoding which can solve these problems. We are particularly talking about the problems of the scalability of evolved solutions. We discuss a possible solution of described problem - a nontrivial genotype-phenotype mapping called development. This technique is demonstrated on an evolutionary design of a sequence of rewriting rules which is able to construct arbitrarily large sorting networks.
|
|
|
Evolutionary Design of Structures Using Rewriting Systems
Dobeš, Michal ; Zachariášová, Marcela (referee) ; Bidlo, Michal (advisor)
This work focuses on application of rewriting systems in the context of biology-inspired development of structures in evolutionary algorithms. As a part of this work, a method has been proposed for design of general structures that uses the aforementioned principle. This document includes an introduction into the theory of sorting networks and their design, the problem of which is later shown to be solvable using the proposed method. In addition, the theoretical background of evolutionary algorithms and rewriting systems is discussed. In the field of rewriting systems, an extension to the class of IL-systems has been created for use in the proposed method. The proposed method has been successfuly applied in the design of growing sorting networks. The results produced by the proposed method significantly outperform the results of the currently best-known comparable method.
|
|
|
Evolutionary Design of Structures Using Rewriting Systems
Dobeš, Michal ; Zachariášová, Marcela (referee) ; Bidlo, Michal (advisor)
This work focuses on application of rewriting systems in the context of biology-inspired development of structures in evolutionary algorithms. As a part of this work, a method has been proposed for design of general structures that uses the aforementioned principle. This document includes an introduction into the theory of sorting networks and their design, the problem of which is later shown to be solvable using the proposed method. In addition, the theoretical background of evolutionary algorithms and rewriting systems is discussed. In the field of rewriting systems, an extension to the class of IL-systems has been created for use in the proposed method. The proposed method has been successfuly applied in the design of growing sorting networks. The results produced by the proposed method significantly outperform the results of the currently best-known comparable method.
|
|
|
Evolutionary Design Using Rewriting Systems
Hýsek, Jiří ; Jaroš, Jiří (referee) ; Bidlo, Michal (advisor)
This work provides an introduction to the evolutionary algorithms and evolutionary design. It also describes disadvantages of direct encoding of a genotype to a phenotype and a method of nontrivial encoding which can solve these problems. We are particularly talking about the problems of the scalability of evolved solutions. We discuss a possible solution of described problem - a nontrivial genotype-phenotype mapping called development. This technique is demonstrated on an evolutionary design of a sequence of rewriting rules which is able to construct arbitrarily large sorting networks.
|
guest ::
